Handling Transient Link Failures Using Alternate Next Hop Counters

نویسندگان

  • Suksant Sae Lor
  • Raul Landa
  • Redouane Ali
  • Miguel Rio
چکیده

In this paper, we propose a routing technique to alleviate packet loss due to transient link failures, which are major causes of disruption in the Internet. The proposed technique based on Alternate Next Hop Counters (ANHC) allows routers to calculate backup paths and re-route packets accordingly, thereby bypassing transient failures. This technique guarantees full repair coverage for single link failures, without significantly changing the way traditional routing works and with minimal impact on the computation and memory requirements for routers. We evaluate the performance of our proposed ANHC approach through extensive simulations and show that the stretch of its pre-computed alternate paths, its failure-state link load increase, and its computational and memory overheads are minimal.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Resilient Routing in the Internet

Although it is widely known that the Internet is not prone to random failures, unplanned failures due to attacks can be very damaging. This prevents many organisations from deploying beneficial operations through the Internet. In general, the data is delivered from a source to a destination via a series of routers (i.e routing path). These routers employ routing protocols to compute best paths ...

متن کامل

Distributed Algorithms for Computing Alternate Paths Avoiding Failed Nodes and Links

A recent study characterizing failures in computer networks shows that transient single element (node/link) failures are the dominant failures in large communication networks like the Internet. Thus, having the routing paths globally recomputed on a failure does not pay off since the failed element recovers fairly quickly, and the recomputed routing paths need to be discarded. In this paper, we...

متن کامل

Fault Tolerant Routing and Scheduling Scheme for Multi Hop Wireless Networks

The multiple link failure recovery algorithm is introduced in this project, to provide the forwarding continuity even with multiple link failures. The transient failures are common in IP networks and it also have some proposals based on local rerouting. To ensure forwarding continuity, introducing the multiple link failure recovery algorithm, even with multiple link failures. For forwarding the...

متن کامل

Thesis Proposal Efficient Algorithms for Alternate Paths and Bridges in Networks and Geometric Graphs

Transient single element (node/link) failures dominate the failures in today’s large communication networks like the Internet [MIB+04]. Thus, having the routing paths globally recomputed on a failure does not pay off since the failed element recovers fairly quickly, and the recomputed routing paths need to be discarded. A popular technique for dealing with such issues is that of using a proacti...

متن کامل

Performance Evaluation of Failed Link Detection in Mobile Ad Hoc Networks

Many ad hoc routing protocols need to determine link failures in the network. For that they keep track of the "next hop" nodes, which are used as next relay points in the routes. Hence the node must be able to recognize the case when a link to a next hop is failed. Most ad hoc routing protocols may detect broken links using hello messages or feedback provided to the protocol by the Medium Acces...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010